Sciweavers

349 search results - page 34 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
COCOON
2003
Springer
14 years 1 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
LREC
2010
130views Education» more  LREC 2010»
13 years 9 months ago
The Problems of Language Identification within Hugely Multilingual Data Sets
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
Fei Xia, Carrie Lewis, William D. Lewis
GD
2006
Springer
13 years 11 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
JGT
2008
97views more  JGT 2008»
13 years 7 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena