Sciweavers

418 search results - page 51 / 84
» A relaxation-based algorithm for solving the conditional p-c...
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
WIDM
2004
ACM
14 years 2 months ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
13 years 8 months ago
Nudelman interpolation, parametrizations of lossless functions and balanced realizations
Abstract: We investigate the parametrization issue for discrete-time stable allpass multivariable systems by means of a Schur algorithm involving a Nudelman interpolation condition...
Jean-Paul Marmorat, Martine Olivi
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
13 years 8 months ago
Invertibility of switched linear systems
Abstract-- We address a new problem--the invertibility problem for continuous-time switched linear systems, which is the problem of recovering the switching signal and the input un...
Linh Vu, Daniel Liberzon
VLDB
1997
ACM
80views Database» more  VLDB 1997»
14 years 27 days ago
Merging Ranks from Heterogeneous Internet Sources
Many sources on the Internet and elsewhere rank the objects in query results according to how well these objects match the original query. For example, a real-estate agent might r...
Luis Gravano, Hector Garcia-Molina