Sciweavers

156 search results - page 12 / 32
» Local Graph Partitioning using PageRank Vectors
Sort
View
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 10 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
KIVS
2011
Springer
12 years 11 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
BMCBI
2011
13 years 6 days ago
Conotoxin Protein Classification Using Free Scores of Words and Support Vector Machines
Background: Conotoxin has been proven to be effective in drug design and could be used to treat various disorders such as schizophrenia, neuromuscular disorders and chronic pain. ...
Nazar Zaki, Stefan Wolfsheimer, Grégory Nue...
PPOPP
2012
ACM
12 years 4 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
14 years 3 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...