Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2023
BLAT: Bootstrapping Language-Audio Pre-training based on AudioSet Tag-guided Synthetic Data
MM '23: Proceedings of the 31st ACM International Conference on MultimediaOctober 2023, Pages 2756–2764https://doi.org/10.1145/3581783.3613820Compared with ample visual-text pre-training research, few works explore audio-text pre-training, mostly due to the lack of sufficient parallel audio-text data. Most existing methods incorporate the visual modality as a pivot for audio-text pre-training, ...
- surveyOctober 2023
Taxonomy of Abstractive Dialogue Summarization: Scenarios, Approaches, and Future Directions
ACM Computing Surveys (CSUR), Volume 56, Issue 3Article No.: 67, Pages 1–38https://doi.org/10.1145/3622933Abstractive dialogue summarization generates a concise and fluent summary covering the salient information in a dialogue among two or more interlocutors. It has attracted significant attention in recent years based on the massive emergence of social ...
- ArticleMay 2018
Unpack Local Model Interpretation for GBDT
Database Systems for Advanced ApplicationsMay 2018, Pages 764–775https://doi.org/10.1007/978-3-319-91458-9_48AbstractA gradient boosting decision tree (GBDT), which aggregates a collection of single weak learners (i.e. decision trees), is widely used for data mining tasks. Because GBDT inherits the good performance from its ensemble essence, much attention has ...
- ArticleJune 2007
Generalized committed choice
COORDINATION'07: Proceedings of the 9th international conference on Coordination models and languagesJune 2007, Pages 191–210We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations from different alternatives to occur concurrently and later commit to one ...
- ArticleApril 2006
Indexing for Dynamic Abstract Regions
ICDE '06: Proceedings of the 22nd International Conference on Data EngineeringApril 2006, Page 12https://doi.org/10.1109/ICDE.2006.81We propose a new main memory index structure for abstract regions (objects) which may heavily overlap, the RCtree. These objects are "dynamic" and may have short life spans. The novelty is that rather than representing an object by its minimum bounding ...
- ArticleOctober 2005
Coordination of many agents
ICLP'05: Proceedings of the 21st international conference on Logic ProgrammingOctober 2005, Pages 98–112https://doi.org/10.1007/11562931_10This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framework is a highly structured shared store in the form of a constraint logic ...
- ArticleNovember 2004
Scalable Distributed Depth-First Search with Greedy Work Stealing
ICTAI '04: Proceedings of the 16th IEEE International Conference on Tools with Artificial IntelligenceNovember 2004, Pages 98–103https://doi.org/10.1109/ICTAI.2004.107We present a framework for the parallelization of depth-first combinatorial search algorithms on a network of computers. Our architecture is intended for a distributed setting and uses a work stealing strategy coupled with a small number of primitives ...
- ArticleSeptember 2004
Ppulation diversity in permutation-based genetic algorithm
ECML'04: Proceedings of the 15th European Conference on Machine LearningSeptember 2004, Pages 537–547https://doi.org/10.1007/978-3-540-30115-8_49This paper presents an empirical study of population diversity measures and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Salesman Problems and Vehicle Routing Problems. We provide detailed graphical ...
- ArticleNovember 2003
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
ICTAI '03: Proceedings of the 15th IEEE International Conference on Tools with Artificial IntelligenceNovember 2003, Page 176This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique decoding scheme with the integer strings. It also automatically adapts the ...
- ArticleMarch 2001
Reactive Web Agents with Open Constraint Programming
ISADS '01: Proceedings of the Fifth International Symposium on Autonomous Decentralized SystemsMarch 2001, Page 251This paper describes a new programming system for writing web applications with reactive agents, i.e. the agents can have complex responses which depend on how the environment changes. Our prototype system is based on the Open Constraint Programming ...