Sciweavers

1814 search results - page 41 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
14 years 22 days ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
CGF
2010
149views more  CGF 2010»
13 years 9 months ago
Over Two Decades of Integration-Based, Geometric Flow Visualization
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
Tony McLoughlin, Robert S. Laramee, Ronald Peikert...
PRICAI
2010
Springer
13 years 7 months ago
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala...
CHI
2007
ACM
14 years 9 months ago
IGroup: presenting web image search results in semantic clusters
Current web image search engines still rely on user typing textual description: query word(s) for visual targets. As the queries are often short, general or even ambiguous, the im...
Shuo Wang, Feng Jing, Jibo He, Qixing Du, Lei Zhan...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 3 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan