Sciweavers

15485 search results - page 198 / 3097
» Computing Optimal Subsets
Sort
View
SIAMNUM
2011
252views more  SIAMNUM 2011»
15 years 1 months ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IPPS
1998
IEEE
15 years 10 months ago
Runtime Support for Virtual BSP Computer
Abstract. Several computing environments including wide area networks and nondedicated networks of workstations are characterized by frequent unavailability of the participating ma...
Mohan V. Nibhanupudi, Boleslaw K. Szymanski
GRC
2007
IEEE
16 years 21 days ago
Towards Mobile Internet: Location Privacy Threats and Granular Computation Challenges
The bulk of contents out on the Internet continue to grow at an astounding pace. As computing and communications become ubiquitous, we are entering the Mobile Internet Computing e...
Ling Liu
FOCS
2006
IEEE
16 years 13 days ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo