Sciweavers

583 search results - page 34 / 117
» Finding Answers to Complex Questions
Sort
View
IJKSR
2011
106views more  IJKSR 2011»
13 years 1 months ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
ICS
2009
Tsinghua U.
14 years 4 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
BMCBI
2010
110views more  BMCBI 2010»
13 years 10 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec