Sciweavers

967 search results - page 158 / 194
» Building a Calculus of Data Structures
Sort
View
DEXAW
1999
IEEE
105views Database» more  DEXAW 1999»
14 years 8 days ago
Personalizing the Web Using Site Descriptions
The information overload on the Web has created a great need for efficient filtering mechanisms. Many sites (e.g., CNN and Quicken) address this problem by allowing a user to crea...
Vinod Anupam, Yuri Breitbart, Juliana Freire, Bhar...
ICVS
1999
Springer
14 years 7 days ago
Ascender II, a Visual Framework for 3D Reconstruction
This paper presents interim results from an ongoing project on aerial image reconstruction. One important task in image interpretation is the process of understanding and identifyi...
Maurício Marengoni, Christopher O. Jaynes, ...
COMPSAC
2007
IEEE
13 years 12 months ago
AOP-based automated unit test classification of large benchmarks
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
Cyrille Artho, Zhongwei Chen, Shinichi Honiden
CIKM
2009
Springer
13 years 12 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
SIGIR
2010
ACM
13 years 12 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan