699 search results - page 44 / 140 » Generalized Distance Functions in the Theory of Computation |
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
ICPR
2002
IEEE
15 years 2 months ago
2002
IEEE
A novel scheme for image segmentation is presented. An image segmentation criterion is proposed that gathers similar pixels together to form regions and creates boundaries between...
102
click to vote
COCO
1994
Springer
15 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...