Sciweavers

1095 search results - page 126 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
202
Voted
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 2 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
142
Voted
PDP
2006
IEEE
15 years 8 months ago
A Distributed Approach to Construction of Topology Mismatching Aware P2P Overlays in Wireless Ad Hoc Networks
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and th...
Yu Huang 0002, Beihong Jin, Jiannong Cao
IPPS
2002
IEEE
15 years 7 months ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
123
Voted

Publication
210views
15 years 9 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
127
Voted
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
15 years 12 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...