Sciweavers

5153 search results - page 730 / 1031
» Introduction to Randomized Algorithms
Sort
View
PAM
2004
Springer
15 years 9 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 9 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
130
Voted
ICCV
2003
IEEE
15 years 9 months ago
An automatic drowning detection surveillance system for challenging outdoor pool environments
Automatically understanding events happening at a site is the ultimate goal of visual surveillance system. This paper investigates the challenges faced by automated surveillance s...
How-Lung Eng, Kar-Ann Toh, Alvin Harvey Kam, Junxi...
ICDAR
2003
IEEE
15 years 9 months ago
Using Character Recognition and Segmentation to Tell Computer from Humans
How do you tell a computer from a human? The situation arises often on the Internet, when online polls are conducted, accounts are requested, undesired email is received, and chat...
Patrice Y. Simard, Richard Szeliski, Josh Benaloh,...
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
15 years 9 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...