Sciweavers

34 search results - page 2 / 7
» The Dense Simple Sets are Orbit Complete with Respect to the...
Sort
View
TKDE
2010
168views more  TKDE 2010»
13 years 5 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
LREC
2010
127views Education» more  LREC 2010»
13 years 8 months ago
A Person-Name Filter for Automatic Compilation of Bilingual Person-Name Lexicons
This paper proposes a simple and fast person-name filter, which plays an important role in automatic compilation of a large bilingual person-name lexicon. This filter is based on ...
Satoshi Sato, Sayoko Kaide
PAMI
2010
160views more  PAMI 2010»
13 years 5 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang
SIROCCO
2000
13 years 8 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
IWPEC
2004
Springer
14 years 5 days ago
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
Robert Haas, Michael Hoffmann