Sciweavers

840 search results - page 58 / 168
» Universal Metadata Standard
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 9 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
ACE
2003
86views Education» more  ACE 2003»
13 years 10 months ago
A New Approach to a First Year Undergraduate Information Systems Course
This paper describes the development, implementation and evaluation of a new teaching approach for a large first year undergraduate course in information systems at the University...
Denise Tolhurst, Bob Baker
INTERSPEECH
2010
13 years 4 months ago
Hierarchical multilayer perceptron based language identification
Automatic language identification (LID) systems generally exploit acoustic knowledge, possibly enriched by explicit language specific phonotactic or lexical constraints. This pape...
David Imseng, Mathew Magimai-Doss, Hervé Bo...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
TPCTC
2009
Springer
106views Hardware» more  TPCTC 2009»
14 years 3 months ago
Measuring Database Performance in Online Services: A Trace-Based Approach
Many large-scale online services use structured storage to persist metadata and sometimes data. The structured storage is typically provided by standard database servers such as Mi...
Swaroop Kavalanekar, Dushyanth Narayanan, Sriram S...