Sciweavers

5384 search results - page 438 / 1077
» Open Standards Requirements
Sort
View
JAIR
2008
173views more  JAIR 2008»
15 years 7 months ago
Creating Relational Data from Unstructured and Ungrammatical Data Sources
In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...
Matthew Michelson, Craig A. Knoblock
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 6 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
DAC
2004
ACM
16 years 8 months ago
Security as a new dimension in embedded system design
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
Srivaths Ravi, Paul C. Kocher, Ruby B. Lee, Gary M...
PPOPP
2010
ACM
16 years 4 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
APLAS
2009
ACM
16 years 1 months ago
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...
Rupesh Nasre, Kaushik Rajan, Ramaswamy Govindaraja...