Sciweavers

265 search results - page 43 / 53
» How to Prove Inductive Theorems
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity Provisioning a Valiant Load-Balanced Network
—Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network de...
Andrew R. Curtis, Alejandro López-Ortiz
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
AIED
2005
Springer
14 years 1 months ago
Advanced Geometry Tutor: An intelligent tutor that teaches proof-writing with construction
: Two problem solving strategies, forward chaining and backward chaining, were compared to see how they affect students’ learning of geometry theorem proving with construction. I...
Noboru Matsuda, Kurt VanLehn
ARITH
2003
IEEE
14 years 1 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger