Sciweavers

2612 search results - page 50 / 523
» Mobile Processes and Termination
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Small-group learning projects to make signal processing more appealing: From speech processing to OFDMA synchronization
Whereas lecturing is the most widely used mode of instruction, we have explored small-group learning projects to make signal processing more appealing at the University and in Eng...
G. Ferre, Audrey Giremus, Eric Grivel
QEST
2008
IEEE
14 years 2 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
FSTTCS
2009
Springer
14 years 12 days ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
IUI
2010
ACM
14 years 4 months ago
Mobia Modeler: easing the creation process of mobile applications for non-technical users
The development of mobile applications has now extended from mobile network providers into the hands of ordinary people as organizations and companies encourage people to come up ...
Florence T. Balagtas-Fernandez, Max Tafelmayer, He...
APAL
2008
111views more  APAL 2008»
13 years 8 months ago
Cut elimination for a simple formulation of epsilon calculus
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Grigori Mints