Sciweavers

344 search results - page 51 / 69
» Some Theorems We Should Prove
Sort
View
IJAC
2006
118views more  IJAC 2006»
13 years 7 months ago
A Correspondence between Balanced Varieties and Inverse Monoids
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
Mark V. Lawson
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ECIR
1998
Springer
13 years 8 months ago
Social and Cognitive Factors in the Design and Evaluation of Multimedia Systems
Multimedia information retrieval systems design is currently considered a complex task since it requires an understanding of users specific way of searching, processing and using ...
Silvia Gabrielli
ICDT
2007
ACM
121views Database» more  ICDT 2007»
14 years 1 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos