Sciweavers

3713 search results - page 712 / 743
» Constructing a Calculus of Programs
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
WISE
2009
Springer
14 years 7 months ago
Web Queries: From a Web of Data to a Semantic Web
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
François Bry, Tim Furche, Klara A. Weiand
SPAA
2009
ACM
14 years 7 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
EUROSYS
2007
ACM
14 years 6 months ago
Concierge: a service platform for resource-constrained devices
As mobile and embedded devices become widespread, the management and configuration of the software in the devices is increasingly turning into a critical issue. OSGi is a busines...
Jan S. Rellermeyer, Gustavo Alonso
ALT
2004
Springer
14 years 6 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala