Sciweavers

2850 search results - page 450 / 570
» On Timed Models and Full Abstraction
Sort
View
126
Voted
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 2 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
107
Voted
BIS
2009
168views Business» more  BIS 2009»
15 years 1 months ago
Defining Adaptation Constraints for Business Process Variants
Abstract. In current dynamic business environment, it has been argued that certain characteristics of ad-hocism in business processes are desirable. Such business processes typical...
Ruopeng Lu, Shazia Wasim Sadiq, Guido Governatori,...
104
Voted
ICA
2004
Springer
15 years 6 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
PATAT
2004
Springer
130views Education» more  PATAT 2004»
15 years 6 months ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith
RTAS
2003
IEEE
15 years 6 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee