Sciweavers

249 search results - page 37 / 50
» Finding Patterns in Given Intervals
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 5 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 2 days ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
INFOCOM
1991
IEEE
13 years 12 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...
AAAI
2010
13 years 10 months ago
User-Specific Learning for Recognizing a Singer's Intended Pitch
We consider the problem of automatic vocal melody transcription: translating an audio recording of a sung melody into a musical score. While previous work has focused on finding t...
Andrew Guillory, Sumit Basu, Dan Morris
CIKM
2008
Springer
13 years 10 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...