Sciweavers

4536 search results - page 247 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 9 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
CRV
2009
IEEE
225views Robotics» more  CRV 2009»
15 years 9 months ago
3D Modeling from Multiple Views with Integrated Registration and Data Fusion
This paper presents an integrated modeling system capable of generating coloured three dimensional representations of a scene observed from multiple viewpoints. Emphasis is given ...
Alain Boyer, Phillip Curtis, Pierre Payeur
GFKL
2005
Springer
101views Data Mining» more  GFKL 2005»
15 years 8 months ago
Discovering Communities in Linked Data by Multi-view Clustering
Abstract. We consider the problem of finding communities in large linked networks such as web structures or citation networks. We review similarity measures for linked objects and...
Isabel Drost, Steffen Bickel, Tobias Scheffer
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 7 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
ICASSP
2011
IEEE
14 years 12 months ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen