Sciweavers

973 search results - page 113 / 195
» New Bounds on Crossing Numbers
Sort
View
ISMVL
2007
IEEE
94views Hardware» more  ISMVL 2007»
16 years 17 days ago
Representations of Elementary Functions Using Edge-Valued MDDs
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
Shinobu Nagayama, Tsutomu Sasao
SPAA
2006
ACM
16 years 7 days ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
COLT
2005
Springer
15 years 11 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 10 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...