Sciweavers

145 search results - page 25 / 29
» Mining closed relational graphs with connectivity constraint...
Sort
View
DCOSS
2008
Springer
15 years 1 months ago
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
Yann Busnel, Leonardo Querzoni, Roberto Baldoni, M...
ACIVS
2006
Springer
15 years 5 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
INFOCOM
2000
IEEE
15 years 4 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 3 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 3 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti