Sciweavers

15485 search results - page 2980 / 3097
» Computing Optimal Subsets
Sort
View
CLUSTER
2009
IEEE
14 years 3 months ago
Combining I/O operations for multiple array variables in parallel netCDF
—Parallel netCDF (PnetCDF) is a popular library used in many scientific applications to store scientific datasets. It provides high-performance parallel I/O while maintaining ...
Kui Gao, Wei-keng Liao, Alok N. Choudhary, Robert ...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
14 years 3 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...
COCOA
2009
Springer
14 years 1 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
CONEXT
2009
ACM
13 years 10 months ago
Cool-Tether: energy efficient on-the-fly wifi hot-spots using mobile phones
We consider the problem of providing ubiquitous yet affordable Internet connectivity to devices at home, at work, and on the move. In this context, we take advantage of two signif...
Ashish Sharma, Vishnu Navda, Ramachandran Ramjee, ...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
« Prev « First page 2980 / 3097 Last » Next »