Sciweavers

10182 search results - page 1998 / 2037
» Case Studies
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 12 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 12 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 12 months ago
Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
Salah A. Aly, Ahmed E. Kamal
EM
2010
155views Management» more  EM 2010»
14 years 12 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
DKE
2008
79views more  DKE 2008»
14 years 12 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
« Prev « First page 1998 / 2037 Last » Next »