Sciweavers

3220 search results - page 307 / 644
» Constrained Graph Processes
Sort
View
EACL
2006
ACL Anthology
15 years 8 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre
TCS
2008
15 years 6 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
TON
2010
83views more  TON 2010»
15 years 5 months ago
Understanding and modeling the internet topology: economics and evolution perspective
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
Xiaoming Wang, Dmitri Loguinov
ICASSP
2011
IEEE
14 years 10 months ago
Multi-sensor estimation and detection of phase-locked sinusoids
This paper proposes a method to compute the likelihood function for the amplitudes and phase shifts of noisily observed phase-locked and amplitude-constrained sinusoids. The sinus...
Christoph Reller, Hans-Andrea Loeliger, Stefano Ma...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...