Sciweavers

1887 search results - page 374 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
14 years 1 months ago
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
Tianyi Jiang, Alexander Tuzhilin
BMCBI
2006
159views more  BMCBI 2006»
13 years 7 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
PVLDB
2010
118views more  PVLDB 2010»
13 years 6 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
CODASPY
2011
12 years 11 months ago
Privacy-preserving activity scheduling on mobile devices
—Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users’ personal schedules. Users also access popular contextbase...
Igor Bilogrevic, Murtuza Jadliwala, Jean-Pierre Hu...