1071 search results - page 142 / 215 » Theories of Automatic Structures and Their Complexity |
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
ICS
2003
Tsinghua U.
14 years 1 months ago
2003
Tsinghua U.
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
CSDA
2006
13 years 8 months ago
2006
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...