Sciweavers

2950 search results - page 33 / 590
» Computing with Infinitely Many Processes
Sort
View
APSEC
2001
IEEE
14 years 13 days ago
Orchestrating Computations on the World-Wide Web
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
Jayadev Misra, Harrick M. Vin
AUTOMATICA
2008
51views more  AUTOMATICA 2008»
13 years 9 months ago
New method for identifying finite degree Volterra series
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...
Wael Suleiman, André Monin
CONCURRENCY
2004
151views more  CONCURRENCY 2004»
13 years 8 months ago
User transparency: a fully sequential programming model for efficient data parallel image processing
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
Frank J. Seinstra, Dennis Koelma
OSDI
2004
ACM
14 years 9 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 9 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...