Sciweavers

1809 search results - page 302 / 362
» Weakly Computable Real Numbers
Sort
View
CCR
2005
76views more  CCR 2005»
13 years 8 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
JSYML
2010
107views more  JSYML 2010»
13 years 7 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
SDM
2012
SIAM
340views Data Mining» more  SDM 2012»
11 years 11 months ago
IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems
A Cyber-Physical System (CPS) integrates physical (i.e., sensor) devices with cyber (i.e., informational) components to form a situation-aware system that responds intelligently t...
Lu An Tang, Quanquan Gu, Xiao Yu, Jiawei Han, Thom...
WWW
2007
ACM
14 years 9 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
CIE
2010
Springer
14 years 26 days ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch