Sciweavers

54 search results - page 8 / 11
» On domination and reinforcement numbers in trees
Sort
View
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
14 years 10 months ago
Online Interval Skyline Queries on Time Series
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
Bin Jiang, Jian Pei
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 2 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
DAC
2005
ACM
13 years 10 months ago
Multiplexer restructuring for FPGA implementation cost reduction
This paper presents a novel synthesis algorithm that reduces the area needed for implementing multiplexers on an FPGA by an average of 18%. This is achieved by reducing the number...
Paul Metzgen, Dominic Nancekievill
ICPR
2006
IEEE
14 years 9 months ago
Efficient, Simultaneous Detection of Multiple Object Classes
At present, the object categorisation literature is still dominated by the use of individual class detectors. Detecting multiple classes then implies the subsequent application of...
Esther Koller-Meier, Luc J. Van Gool, Philipp Zehn...
WG
2010
Springer
13 years 6 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski