740 search results - page 112 / 148 » Lower bounds for Buchsbaum* complexes |
153
click to vote
IPPS
2006
IEEE
16 years 6 days ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
170
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
125
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
146
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
173
click to vote
ICRA
2007
IEEE
16 years 15 days ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...