Sciweavers

4894 search results - page 644 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CIKM
2003
Springer
15 years 9 months ago
An approach for implicitly detecting information needs
Searchers can have problems devising queries that accurately express their, often dynamic, information needs. In this paper we describe an adaptive approach that uses unobtrusive ...
Ryen White, Joemon M. Jose, Ian Ruthven
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 9 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
131
Voted
FOCS
2002
IEEE
15 years 9 months ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
ICPR
2002
IEEE
15 years 9 months ago
Image Flows and One-Liner Graphical Image Representation
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
Vadim Makhervaks, Gill Barequet, Alfred M. Bruckst...
ICPR
2002
IEEE
15 years 9 months ago
Near-Optimal Regularization Parameters for Applications in Computer Vision
Computer vision requires the solution of many ill-posed problems such as optical flow, structure from motion, shape from shading, surface reconstruction, image restoration and ed...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis