Sciweavers

4949 search results - page 107 / 990
» Consistency and Set Intersection
Sort
View
CIKM
2008
Springer
15 years 6 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
CCCG
1997
15 years 5 months ago
On the number of internal and external visibility edges of polygons
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
Jorge Urrutia
ENDM
2008
90views more  ENDM 2008»
15 years 4 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
DCG
2002
106views more  DCG 2002»
15 years 4 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky
CDC
2009
IEEE
15 years 9 months ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi