Sciweavers

528 search results - page 48 / 106
» Degrees of categoricity of computable structures
Sort
View
VMV
2000
119views Visualization» more  VMV 2000»
13 years 10 months ago
Orientation Estimation Based on Weighted Projection onto Quadratic Polynomials
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
Gunnar Farnebäck
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
WWW
2004
ACM
14 years 9 months ago
What's new on the web?: the evolution of the web from a search engine perspective
We seek to gain improved insight into how Web search engines should cope with the evolving Web, in an attempt to provide users with the most up-to-date results possible. For this ...
Alexandros Ntoulas, Junghoo Cho, Christopher Olsto...
ICS
2003
Tsinghua U.
14 years 1 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
14 years 9 months ago
Degree-of-Freedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
Samir Roy, Biplab K. Sikdar, Monalisa Mukherjee, D...