Sciweavers

2435 search results - page 426 / 487
» Intellexer Question Answering
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 20 days ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
96
Voted
DM
2008
94views more  DM 2008»
15 years 19 days ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros
88
Voted
GIS
2008
ACM
15 years 18 days ago
Geographical analysis of hierarchical business structures by interactive drill down
This paper deals with the geographical analysis and visualization of network marketing. The aim of the study was to develop interactive visual methods, which help to answer questi...
Klaus Böhm, Eva Daub
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 17 days ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
93
Voted
IJON
2006
76views more  IJON 2006»
15 years 16 days ago
Evolving networks of integrate-and-fire neurons
This paper addresses the following question: ``What neural circuits can emulate the monosynaptic correlogram generated by a direct connection between two neurons?'' The ...
Francisco J. Veredas, Francisco J. Vico, Jos&eacut...