Sciweavers

410 search results - page 82 / 82
» Incremental Construction of Structured Hidden Markov Models
Sort
View
WECWIS
2009
IEEE
104views ECommerce» more  WECWIS 2009»
14 years 5 months ago
Online Auctions: There Can Be Only One
—In recent years, the proliferation of the world wide web has lead to an increase in the number of public auctions on the internet. One of the characteristics of online auctions ...
Charu C. Aggarwal, Philip S. Yu
QEST
2008
IEEE
14 years 4 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...
PLDI
2009
ACM
14 years 5 months ago
Laminar: practical fine-grained decentralized information flow control
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
Indrajit Roy, Donald E. Porter, Michael D. Bond, K...
SIGGRAPH
1997
ACM
14 years 1 months ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 2 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...