Sciweavers

1402 search results - page 123 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 3 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
DEXAW
2000
IEEE
81views Database» more  DEXAW 2000»
15 years 2 months ago
Evaluation of Different Visualizations of Web Search Results
This paper discusses the evaluation of a visual information seeking system for the Web called INSYDER. The aim of INSYDER is to find business information on the Web. The evaluatio...
Thomas M. Mann, Harald Reiterer
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
15 years 11 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...