Sciweavers

2577 search results - page 192 / 516
» Multimedia Question Answering
Sort
View
WAIFI
2007
Springer
122views Mathematics» more  WAIFI 2007»
16 years 18 days ago
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
The first APN polynomials EA-inequivalent to power functions have been constructed in [7, 8] by applying CCZ-equivalence to the Gold APN functions. It is a natural question wheth...
Lilya Budaghyan
ICALT
2006
IEEE
16 years 16 days ago
AWELS: Adaptive Web-Based Education and Learning Styles
Can learning styles (LS) be applied in current webbased systems? What are the main issues when applying LS in web-based systems? Can LS be authored in current web-based systems? W...
Alexandra I. Cristea, Natalia Stash
DEXAW
2005
IEEE
116views Database» more  DEXAW 2005»
16 years 3 days ago
Towards Self-Predicting Systems: What If You Could Ask "What-If"?
Today, management and tuning questions are approached using if...then... rules of thumb. This reactive approach requires expertise regarding of system behavior, making it difficu...
Eno Thereska, Dushyanth Narayanan, Gregory R. Gang...
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
16 years 22 hour ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
COCOON
2005
Springer
16 years 22 hour ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier