Sciweavers

1322 search results - page 153 / 265
» Parameterized counting problems
Sort
View
ICCV
2003
IEEE
15 years 5 days ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
CDC
2009
IEEE
101views Control Systems» more  CDC 2009»
14 years 3 months ago
Barrier function nonlinear optimization for optimal Decompression of divers
— This paper is based on a comprehensive dynamic mathematical model (Copernicus) of vascular bubble formation and growth during and after decompression from a dive. The model des...
Le Feng, Christian R. Gutvik, Tor Arne Johansen, D...
AAAI
2006
13 years 11 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 11 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 10 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...