Sciweavers

125 search results - page 18 / 25
» N Semantic Classes are Harder than Two
Sort
View
85
Voted
CPAIOR
2006
Springer
15 years 1 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
82
Voted
MM
2009
ACM
156views Multimedia» more  MM 2009»
15 years 4 months ago
Understanding near-duplicate videos: a user-centric approach
Popular content in video sharing web sites (e.g., YouTube) is usually duplicated. Most scholars define near-duplicate video clips (NDVC) based on non-semantic features (e.g., di...
Mauro Cherubini, Rodrigo de Oliveira, Nuria Oliver
82
Voted
WINE
2005
Springer
146views Economy» more  WINE 2005»
15 years 3 months ago
A Cost Mechanism for Fair Pricing of Resource Usage
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
Marios Mavronicolas, Panagiota N. Panagopoulou, Pa...
SIAMDM
2002
94views more  SIAMDM 2002»
14 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
64
Voted
ENTCS
2000
59views more  ENTCS 2000»
14 years 9 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline