Sciweavers

2107 search results - page 234 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CAISE
2003
Springer
14 years 2 months ago
Processing Queries in a Large Peer-to-Peer System
While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the...
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, Dav...
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
14 years 28 days ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
DAC
1997
ACM
14 years 1 months ago
Multilevel Hypergraph Partitioning: Application in VLSI Domain
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergra...
George Karypis, Rajat Aggarwal, Vipin Kumar, Shash...
VLDB
2000
ACM
133views Database» more  VLDB 2000»
14 years 26 days ago
Memex: A Browsing Assistant for Collaborative Archiving and Mining of Surf Trails
Keyword indices, topic directories, and link-based rankings are used to search and structure the rapidly growing Web today. Surprisingly little use is made of years of browsing ex...
Soumen Chakrabarti, Sandeep Srivastava, Mallela Su...
SSDBM
2003
IEEE
105views Database» more  SSDBM 2003»
14 years 2 months ago
Using Bitmap Index for Interactive Exploration of Large Datasets
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
Kesheng Wu, Wendy S. Koegler, Jacqueline Chen, Ari...