Sciweavers

2498 search results - page 207 / 500
» Data Structures with Unpredictable Timing
Sort
View
LAWEB
2005
IEEE
15 years 8 months ago
A Parallel Search Engine with BSP
With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is big...
Veronica Gil Costa, Mauricio Marín
DEXA
2004
Springer
140views Database» more  DEXA 2004»
15 years 7 months ago
Declustering of Trajectories for Indexing of Moving Objects Databases
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
Youngduk Seo, Bonghee Hong
IFIP
2004
Springer
15 years 7 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
119
Voted
ICDM
2003
IEEE
225views Data Mining» more  ICDM 2003»
15 years 7 months ago
Combining the web content and usage mining to understand the visitor behavior in a web site
A web site is a semi structured collection of different kinds of data, whose motivation is show relevant information to visitor and by this way capture her/his attention. Understa...
Juan D. Velásquez, Hiroshi Yasuda, Terumasa...
ICASSP
2010
IEEE
15 years 2 months ago
Fast semi-supervised image segmentation by novelty selection
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
António R. C. Paiva, Tolga Tasdizen