Sciweavers

1345 search results - page 14 / 269
» A Class of Logarithmic Integrals
Sort
View
ECCV
2010
Springer
14 years 1 months ago
ClassCut for Unsupervised Class Segmentation
Abstract. We propose a novel method for unsupervised class segmentation on a set of images. It alternates between segmenting object instances and learning a class model. The method...
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
14 years 2 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
BIRTHDAY
2010
Springer
13 years 9 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
INFOCOM
1999
IEEE
14 years 1 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste
EUROCRYPT
1999
Springer
14 years 1 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier