Sciweavers

2950 search results - page 542 / 590
» Computing with Infinitely Many Processes
Sort
View
COOPIS
2004
IEEE
14 years 18 days ago
Composing Mappings Between Schemas Using a Reference Ontology
Large-scale database integration requires a significant cost in developing a global schema and finding mappings between the global and local schemas. Developing the global schema r...
Eduard C. Dragut, Ramon Lawrence
COMPGEOM
2006
ACM
14 years 17 days ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ISMIR
2000
Springer
148views Music» more  ISMIR 2000»
14 years 13 days ago
IR for Contemporary Music: What the Musicologist Needs
Active listening is the core of musical activity Listening does not only concern receiving musical information. On the contrary, it is "active" and based on a set of int...
Alain Bonardi
ECCV
2010
Springer
13 years 11 months ago
Depth-Encoded Hough Voting for joint object detection and shape recovery
Detecting objects, estimating their pose and recovering 3D shape information is a critical problem in many vision and robotics applications. This paper addresses the above needs by...
FAST
2008
13 years 11 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...