Sciweavers

2294 search results - page 185 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ICIP
2000
IEEE
15 years 11 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
86
Voted
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
15 years 3 months ago
Partial Elastic Matching of Time Series
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
INFOCOM
1993
IEEE
15 years 2 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
MICRO
2003
IEEE
70views Hardware» more  MICRO 2003»
15 years 3 months ago
Fast Path-Based Neural Branch Prediction
Microarchitectural prediction based on neural learning has received increasing attention in recent years. However, neural prediction remains impractical because its superior accur...
Daniel A. Jiménez
74
Voted
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 10 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel