1322 search results - page 153 / 265 » Parameterized counting problems |
113
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
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...
100
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— 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...
146
Voted
AAAI
2006
15 years 4 months ago
2006
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...
95
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
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 ...
123
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
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...