Sciweavers

7619 search results - page 1381 / 1524
» Interaction, observance or both
Sort
View
SIROCCO
2004
13 years 11 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
NIPS
1998
13 years 11 months ago
Learning Nonlinear Dynamical Systems Using an EM Algorithm
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
Zoubin Ghahramani, Sam T. Roweis
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 11 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
CIDR
2009
139views Algorithms» more  CIDR 2009»
13 years 11 months ago
Inter-Operator Feedback in Data Stream Management Systems via Punctuation
High-volume, high-speed data streams may overwhelm the capabilities of stream processing systems; techniques such as data prioritization, avoidance of unnecessary processing and o...
Rafael Fernández-Moctezuma, Kristin Tufte, ...
« Prev « First page 1381 / 1524 Last » Next »