Sciweavers

249 search results - page 7 / 50
» Finding Patterns in Given Intervals
Sort
View
JUCS
2008
151views more  JUCS 2008»
13 years 8 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
IJCGA
2010
99views more  IJCGA 2010»
13 years 6 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
EOR
2008
136views more  EOR 2008»
13 years 8 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
DKE
2008
83views more  DKE 2008»
13 years 8 months ago
Mining fuzzy periodic association rules
We develop techniques for discovering patterns with periodicity in this work. Patterns with periodicity are those that occur at regular time intervals, and therefore there are two...
Wan-Jui Lee, Jung-Yi Jiang, Shie-Jue Lee
IJCAI
2001
13 years 9 months ago
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
Luc De Raedt, Stefan Kramer