Sciweavers

470 search results - page 92 / 94
» Using Unknown Word Techniques to Learn Known Words
Sort
View
VLDB
2001
ACM
146views Database» more  VLDB 2001»
14 years 8 months ago
Combining multi-visual features for efficient indexing in a large image database
Abstract. The optimized distance-based access methods currently available for multidimensional indexing in multimedia databases have been developed based on two major assumptions: ...
Anne H. H. Ngu, Quan Z. Sheng, Du Q. Huynh, Ron Le...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 12 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
SIAMSC
2008
149views more  SIAMSC 2008»
13 years 7 months ago
Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation
In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematic...
Peter Deuflhard, Wilhelm Huisinga, T. Jahnke, Mich...
JACM
2007
132views more  JACM 2007»
13 years 7 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
JCB
2007
94views more  JCB 2007»
13 years 7 months ago
Locality and Gaps in RNA Comparison
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M...