Sciweavers

1395 search results - page 199 / 279
» Modeling betweenness for question answering
Sort
View
COMPGEOM
2006
ACM
16 years 9 days ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
ITICSE
2006
ACM
16 years 8 days ago
ASSISTing CS1 students to learn: learning approaches and object-oriented programming
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...
Janet Hughes, D. Ramanee Peiris
APCSAC
2005
IEEE
15 years 12 months ago
An Integrated Partitioning and Scheduling Based Branch Decoupling
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
Pramod Ramarao, Akhilesh Tyagi
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 10 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin