Sciweavers

853 search results - page 33 / 171
» Are many small sets explicitly small
Sort
View
JAL
1998
85views more  JAL 1998»
15 years 5 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
16 years 7 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
SCALESPACE
2009
Springer
16 years 22 days ago
On Semi-implicit Splitting Schemes for the Beltrami Color Flow
The Beltrami flow is an efficient non-linear filter, that was shown to be effective for color image processing. The corresponding anisotropic diffusion operator strongly couple...
Lorina Dascal, Guy Rosman, Xue-Cheng Tai, Ron Kimm...
ICAIL
2009
ACM
15 years 11 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...
BMCBI
2010
117views more  BMCBI 2010»
15 years 1 months ago
Screensaver: an open source lab information management system (LIMS) for high throughput screening facilities
Background: Shared-usage high throughput screening (HTS) facilities are becoming more common in academe as large-scale small molecule and genome-scale RNAi screening strategies ar...
Andrew N. Tolopko, John P. Sullivan, Sean D. Erick...