Sciweavers

2270 search results - page 234 / 454
» On the distribution of eigenvalues of graphs
Sort
View
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 8 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
MTA
2006
156views more  MTA 2006»
15 years 6 months ago
DAG-based visual interfaces for navigation in indexed video content
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
Maylis Delest, Anthony Don, Jenny Benois-Pineau
SIGIR
2008
ACM
15 years 6 months ago
Compressed collections for simulated crawling
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...
Alessio Orlandi, Sebastiano Vigna
EJC
2008
15 years 5 months ago
Locating sensors in paths and cycles: The case of 2-identifying codes
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
David L. Roberts, Fred S. Roberts
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
16 years 27 days ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas