1566 search results - page 124 / 314 » On a Cone Covering Problem |
163
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
142
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
155
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
el Predicate Abstraction and Refinement for Verifying RTL Verilog Himanshu Jain CMU SCS, Pittsburgh, PA 15213 Daniel Kroening ETH Z?urich, Switzerland Natasha Sharygina CMU SCS an...
167
click to vote
NIPS
2007
15 years 7 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
194
click to vote
3DOR
2010
15 years 1 months ago
2010
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...