Sciweavers

3020 search results - page 243 / 604
» Optimal partition trees
Sort
View
TCAD
2008
128views more  TCAD 2008»
15 years 6 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
PE
2010
Springer
175views Optimization» more  PE 2010»
15 years 1 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
ICALP
2009
Springer
16 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SSD
2005
Springer
185views Database» more  SSD 2005»
16 years 4 days ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
ICIP
2006
IEEE
16 years 8 months ago
Low Complexity Inter-Mode Selection for H.264
The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitio...
Seydou-Nourou Ba, Yucel Altunbasak, Hasan F. Ates