Sciweavers

701 search results - page 130 / 141
» Kolmogorov complexity in perspective
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ISVC
2009
Springer
16 years 18 days ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
16 years 15 days ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...
ICTAI
2008
IEEE
16 years 14 days ago
Information Extraction as an Ontology Population Task and Its Application to Genic Interactions
Ontologies are a well-motivated formal representation to model knowledge needed to extract and encode data from text. Yet, their tight integration with Information Extraction (IE)...
Alain-Pierre Manine, Érick Alphonse, Philip...
IEEESCC
2007
IEEE
16 years 11 days ago
Deriving executable BPEL from UMM Business Transactions
UN/CEFACT’s Modeling Methodology (UMM) is a UML profile for modeling global B2B choreographies. The basic building blocks of UMM are business transactions, which describe the e...
Birgit Hofreiter, Christian Huemer, Philipp Liegl,...