Sciweavers

5128 search results - page 1015 / 1026
» When Abstraction Fails
Sort
View
CCR
2011
13 years 2 months ago
The politecast communication primitive for low-power wireless
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
Marcus Lundén, Adam Dunkels
IANDC
2011
148views more  IANDC 2011»
13 years 2 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
COST
2010
Springer
194views Multimedia» more  COST 2010»
13 years 2 months ago
The MultiLis Corpus - Dealing with Individual Differences in Nonverbal Listening Behavior
Abstract. Computational models that attempt to predict when a virtual human should backchannel are often based on the analysis of recordings of face-to-face conversations between h...
Iwan de Kok, Dirk Heylen
SIAMMAX
2011
180views more  SIAMMAX 2011»
13 years 2 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
« Prev « First page 1015 / 1026 Last » Next »