Sciweavers

29908 search results - page 5827 / 5982
» On the Complexity of
Sort
View
CVIU
2004
134views more  CVIU 2004»
13 years 7 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
AI
2000
Springer
13 years 7 months ago
Wrapper induction: Efficiency and expressiveness
The Internet presents numerous sources of useful information--telephone directories, product catalogs, stock quotes, event listings, etc. Recently, many systems have been built th...
Nicholas Kushmerick
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
CACM
2000
120views more  CACM 2000»
13 years 7 months ago
Universal Usability
ost abstract sense, we build web pages so that computers can read them. The software that people use to access web pages is what "reads" the document. How the page is ren...
Ben Shneiderman
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
« Prev « First page 5827 / 5982 Last » Next »