2168 search results - page 317 / 434 » Randomized Algorithms and Complexity Theory |
165
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
140
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
143
Voted
DMIN
2008
15 years 4 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
144
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we focus on the design of Markov Chain Monte Carlo techniques in a statistical registration framework based on finite element basis (FE). Due to the use of FE basis...
140
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
With increasing aggregate off-chip bandwidths exceeding terabits/second (Tb/s), the power dissipation is a serious design consideration. Additionally, design of I/O links is const...