Sciweavers

725 search results - page 22 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
75
Voted
ENTCS
2006
113views more  ENTCS 2006»
14 years 9 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
68
Voted
CIKM
2009
Springer
15 years 4 months ago
Compressing tags to find interesting media groups
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
ATAL
2005
Springer
15 years 3 months ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...
ICRA
1998
IEEE
148views Robotics» more  ICRA 1998»
15 years 1 months ago
Position Estimation Using Principal Components of Range Data
1 sensors is to construct a structural description from sensor data and to match this description to a previously acquired model [Crowley 85]. An alternative is to project individu...
James L. Crowley, Frank Wallner, Bernt Schiele
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
15 years 10 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu