MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Bounds for Selection." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

331 documents found, showing 1 through 10. Next 10 →

ATOM

On Lower Bounds for Selecting the Median
by Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick — 1996
…ON LOWER BOUNDS FOR SELECTING THE MEDIAN DORIT DOR , JOHAN HSTAD y , STAFFAN ULFBERG y…
Cited by 3 (2 self) – Add To MetaCart

On Lower Bounds for Selecting the Median
by Dorit Dor Johan, Staoean Ulfberg, Uri Zwick — 1996 — In preparation
…On lower bounds for selecting the median Dorit Dor Johan H#stad y Staoean Ulfberg y Uri…
Add To MetaCart

Upper and Lower Bounds for Selection on the Mesh
by Anne Condon, Lata Narayanan — 1993 — In Symposium on Parallel and Distributed Processing
…Upper and Lower Bounds for Selection on the Mesh Anne Condon Department of Computer Science…
Cited by 3 (1 self) – Add To MetaCart

Tight lower bounds for selection in randomly ordered streams
by Amit Chakrabarti — 2008 — In SODA
…Tight Lower Bounds for Selection in Randomly Ordered Streams Abstract Amit Chakrabarti ∗ ac…
Cited by 6 (2 self) – Add To MetaCart

On Lower Bounds for Circuits and Selection
by Staan Ulfberg Stockholm, Högskolan Stockholm
…On Lower Bounds for Circuits and Selection Sta�an Ulfberg Stockholm 1999 Doctoral Dissertation…
Add To MetaCart

Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines
by C. Greg Plaxton — 1995 — In Proceedings of the 36th Annual Symposium on Foundations of Computer Science
…Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines C…
Cited by 2 (0 self) – Add To MetaCart

Recovering Resources in the π-Calculus
by David Teller
… applications, and provide a type-based technique for statically proving resource bounds. Selected examples…
Add To MetaCart

New Interval Analysis Support Functions Using Gradient Information In A Global Minimization Algorithm
by L.G. Casado, I. García, J.A. Martínez, Ya.D. SERGEYEV — 2000
… of selection, bounding, elimination, division, and termination rules used in their implementations. The whole…
Cited by 3 (0 self) – Add To MetaCart

Adaptive Correlation Tracking of Targets With Changing Scale
by Ulf M. Cahn von Seelen, Ulf M, Bajcsy Ruzena — 1996 — University of Pennsylvania, Department of Computer and Information Science
… patch and updates the template only when the scaling exceeds given bounds. The selective template update…
Cited by 2 (0 self) – Add To MetaCart

On the Network Complexity of Selection
by Greg Plaxton Department, C. Greg Plaxton — 1989 — In Proceedings of the 30th Annual Symposium on Foundations of Computer Science
… unique key with rank k. The lower bound will apply to the special case of the selection problem where all…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB