696 search results - page 131 / 140 » A class of combinatorial identities |
IJCV
2008
14 years 11 months ago
2008
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
JMLR
2010
14 years 6 months ago
2010
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
119
click to vote
ASIACRYPT
2011
Springer
13 years 11 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
136
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...