Sciweavers

11160 search results - page 2219 / 2232
» Incompleteness in a General Setting
Sort
View
SIGMOD
2011
ACM
218views Database» more  SIGMOD 2011»
12 years 10 months ago
A data-oriented transaction execution engine and supporting tools
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
Ippokratis Pandis, Pinar Tözün, Miguel B...
ICCV
2011
IEEE
12 years 7 months ago
Learning Universal Multi-view Age Estimator by Video Contexts
Most existing techniques for analyzing face images assume that the faces are at near-frontal poses. Generalizing to non-frontal faces is often difficult, due to a dearth of groun...
Zheng Song, Bingbing Ni, Dong Guo, Terence Sim, Sh...
ANCS
2011
ACM
12 years 7 months ago
A Scalability Study of Enterprise Network Architectures
The largest enterprise networks already contain hundreds of thousands of hosts. Enterprise networks are composed of Ethernet subnets interconnected by IP routers. These routers re...
Brent Stephens, Alan L. Cox, Scott Rixner, T. S. E...
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
12 years 7 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 7 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
« Prev « First page 2219 / 2232 Last » Next »