Sciweavers

376 search results - page 45 / 76
» On the Advice Complexity of Online Problems
Sort
View
IPPS
2003
IEEE
15 years 5 months ago
MUSE: A Software Oscilloscope for Clusters and Grids
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
Mark K. Gardner, Michael Broxton, Adam Engelhart, ...
STACS
1999
Springer
15 years 4 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
IPPS
1998
IEEE
15 years 4 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
GIS
2009
ACM
15 years 3 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 1 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu