876 search results - page 73 / 176 » Limits on the Usefulness of Random Oracles |
122
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
100
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
113
Voted
MOBICOM
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
118
Voted
CPC
1999
15 years 11 days ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
114
Voted
TASE
2008
IEEE
15 years 19 days ago
2008
IEEE
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...